Average-Case Intractable NP Problems
نویسنده
چکیده
منابع مشابه
Contents 1 Average - Case Computational Complexity Theory 1
NP-complete problems are generally thought of as being com-putationally intractable. However, NP-completeness is a worst-case concept. Indeed, some NP-complete problems are \easy on average," though some may not be. How is one to know whether an NP-complete problem is \diicult on average"? The theory of average-case computational complexity , initiated by Levin about ten years ago, is devoted t...
متن کاملComputational Complexity Theory
Being NP complete has been widely interpreted as being computationally intractable But NP completeness is a worst case concept Some NP complete problems are easy on average but some may not be How is one to know whether an NP complete problem is di cult on average The theory of average case computational complexity initiated by Levin about ten years ago is devoted to studying this problem This ...
متن کاملEncyclopaedia of Complexity Results for Finite - Horizon MarkovDecision Process Problems
The computational complexity of nite horizon policy evaluation and policy existence problems are studied for several policy types and representations of Markov decision processes. In almost all cases, the problems are shown to be complete for their complexity classes; classes range from nondeterministic logarithmic space and probabilistic logarithmic space (highly parallelizable classes) to exp...
متن کاملCone-Constrained Principal Component Analysis
Estimating a vector from noisy quadratic observations is a task that arises naturally in many contexts, from dimensionality reduction, to synchronization and phase retrieval problems. It is often the case that additional information is available about the unknown vector (for instance, sparsity, sign or magnitude of its entries). Many authors propose non-convex quadratic optimization problems th...
متن کاملAutomated Algorithm Configuration and Parameter Tuning
Computationally challenging problems arise in the context of many applications, and the ability to solve these as efficiently as possible is of great practical, and often also economical importance. Examples of such problems include scheduling, timetabling, resource allocation, production planning and optimisation, computer-aided design and software verification. Many of these problems are NP-h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997